Nature-Inspired Algorithms: State-of-Art, Problems and Prospects
نویسندگان
چکیده
منابع مشابه
Nature-Inspired Algorithms: State-of-Art, Problems and Prospects
Nature-inspired algorithms have gained immense popularity in recent years to tackle hard real world (NP hard and NP complete) problems and solve complex optimization functions whose actual solution doesn't exist. The paper presents a comprehensive review of 12 nature inspired algorithms. This study provides the researchers with a single platform to analyze the conventional and contemporary...
متن کاملA State of Art Review on Application of Nature Inspired Optimization Algorithms in Protein-Ligand Docking
The problem of molecular docking is to find the best position and orientation of small molecules (Ligand) to a larger receptor molecule whose binding sites are already known. The process of docking is of vital importance in the development of new therapeutics as it can alter the chemical behaviour of receptor macromolecule. Mathematically, protein-ligand docking can be formulated as an optimiza...
متن کاملDynamic Vehicle Routing Problems: State Of The Art and Prospects
This scientific report summarizes the results of a literature review on dynamic vehicle routing problems. After a brief description of vehicle routing problems in general, a classification is introduced to distinguish between static and dynamic problems. Then a more precise definition of dynamism is presented, supported by example of real-world applications of such problems. Finally, a detailed...
متن کاملNature-Inspired Optimization Algorithms
The performance of any algorithm will largely depend on the setting of its algorithmdependent parameters. The optimal setting should allow the algorithm to achieve the best performance for solving a range of optimization problems. However, such parameter tuning is itself a tough optimization problem. In this chapter, we present a framework for self-tuning algorithms so that an algorithm to be t...
متن کاملNature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics, in particular, the modular exon-intron structure of eukaryotic genes. Two representative packing problems are used to test the utility of the proposed approach: the bin packing problem (BPP) and the multiple knapsack ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/17593-8331